Two new Levenberg-Marquardt methods for nonsmooth nonlinear complementarity problems
نویسندگان
چکیده
منابع مشابه
Global Complexity Bound Analysis of the Levenberg-Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem
We investigate a global complexity bound of the Levenberg-Marquardt Method (LMM) for nonsmooth equations F (x) = 0. The global complexity bound is an upper bound to the number of iterations required to get an approximate solution such that ∥∇f(x)∥ ≤ ε, where f is a least square merit function and ε is a given positive constant. We show that the bound of the LMM is O(ε−2). We also show that it i...
متن کاملNonsmooth Levenberg-Marquardt Type Method for Solving a Class of Stochastic Linear Complementarity Problems with Finitely Many Elements
Abstract: Our purpose of this paper is to solve a class of stochastic linear complementarity problems (SLCP) with finitely many elements. Based on a new stochastic linear complementarity problem function, a new semi-smooth least squares reformulation of the stochastic linear complementarity problem is introduced. For solving the semi-smooth least squares reformulation, we propose a feasible non...
متن کاملOn Levenberg-Marquardt Kaczmarz regularization methods for ill-posed problems
We investigate modified Levenberg-Marquardt methods coupled with a Kaczmarz strategy for obtaining stable solutions of nonlinear systems of ill-posed operator equations. We show that the proposed method is a convergent regularization method.
متن کاملLevenberg-Marquardt Level Set Methods for Inverse Obstacle Problems
The aim of this paper is to construct Levenberg-Marquardt level set methods for inverse obstacle problems, and to discuss their numerical realization. Based on a recently developed framework for the construction of level set methods, we can define LevenbergMarquardt level set methods in a general way by varying the function space used for the normal velocity. In the typical case of a PDE-constr...
متن کاملLevenberg-Marquardt Method for Mathematical Programs with Linearly Complementarity Constraints
In this paper, a new method for solving a mathematical programming problem with linearly complementarity constraints (MPLCC) is introduced, which applies the Levenberg-Marquardt (L-M) method to solve the B-stationary condition of original problem. Under the MPEC-LICQ, the proposed method is proved convergent to B-stationary point of MPLCC.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ScienceAsia
سال: 2014
ISSN: 1513-1874
DOI: 10.2306/scienceasia1513-1874.2014.40.089